Cut formulas in propositional logic
نویسندگان
چکیده
منابع مشابه
Reducing separation formulas to propositional logic
We show a reduction to propositional logic from a Boolean combination of inequalities of the form and , where is a constant and are variables of type real or integer. Equalities and uninterpreted functions can be expressed in this logic as well. We discuss the advantages of using this reduction as compared to competing methods, and present experimental results that support our claims. This rese...
متن کاملLinear Formulas in Continuous Logic
We prove that continuous sentences preserved by the ultramean construction (a generalization of the ultraproduct construction) are exactly those sentences which are approximated by linear sentences. Continuous sentences preserved by linear elementary equivalence are exactly those sentences which are approximated in the Riesz space generated by linear sentences. Also, characterizations for linea...
متن کاملAnalytic Cut for Propositional Dynamic Logic
We present a Gentzen system GPDL for Propositional Dynamic Logic, deriving the classical Segerberg axiomatization from our system. The main contribution consists in proving that the system presented is equivalent to a subsystem where only Analytic Cut of a special and restricted kind is permitted. This resolves the long-standing open problem of Cut-elimination for Propositional Dynamic Logic.
متن کاملPurely equivalential propositional formulas in the intermediate Godel-Dummett logic
. 1 Preliminaries Consider the variety Eω generated by the algebra ω := (N, ·), where i · j := max (i, j) for i 6= j, and i · j := 1 for i = j, i, j ∈ N1. These variety is a subvariety of the variety of equivalential algebras E . By an equivalential algebra we mean a grupoid A = (A,↔) that is a subreduct of a Brouwerian semilattice (or, equivalently, a Heyting algebra) with the operation ↔ give...
متن کاملParsing permutations of first-order propositional logic formulas
In this work, we wish to determine the complexity of deciding whether a given multiset of symbols, chosen from some finite set of symbols, can be derived according to the rules of a given context-free grammar. Providing an upper bound for this problem is of interest to computational linguistics, one goal of which is to classify the complexity of parsing and understanding natural language. We co...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 1993
ISSN: 0304-3975
DOI: 10.1016/0304-3975(93)90249-s